PRISM

Benchmark
Model:resource-gathering v.2 (MDP)
Parameter(s)B = 1300, GOLD_TO_COLLECT = 100, GEM_TO_COLLECT = 100
Property:expgold (exp-reward-step-bounded)
Invocation (default)
./fix-syntax ./prism -javamaxmem 11g -cuddmaxmem 4g -ii -e 5e-2 -heuristic speed -ddextraactionvars 100 -maxiters 1000000 resource-gathering.pm resource-gathering.prctl --property expgold -const B=1300,GOLD_TO_COLLECT=100,GEM_TO_COLLECT=100
Execution
Walltime:37.233455181121826s
Return code:0
Relative Error:4.756139514894884e-15
Log
PRISM
=====

Version: 4.5.dev
Date: Sat Mar 14 23:35:50 UTC 2020
Hostname: e72bdd194fc5
Memory limits: cudd=4g, java(heap)=11g
Command line: prism -javamaxmem 11g -cuddmaxmem 4g -ii -e 5e-2 -heuristic speed -ddextraactionvars 100 -maxiters 1000000 resource-gathering.pm_fixed resource-gathering.prctl_fixed --property expgold -const 'B=1300,GOLD_TO_COLLECT=100,GEM_TO_COLLECT=100'

Parsing model file "resource-gathering.pm_fixed"...

Type:        MDP
Modules:     robot goldcounter gemcounter 
Variables:   gold gem attacked x y required_gold required_gem 

Parsing properties file "resource-gathering.prctl_fixed"...

3 properties:
(1) "expgold": R{"rew_gold"}max=? [ C<=B ]
(2) "expsteps": R{"time_reward"}min=? [ F "success" ]
(3) "prgoldgem": Pmax=? [ F<=B "success" ]

---------------------------------------------------------------------

Model checking: "expgold": R{"rew_gold"}max=? [ C<=B ]
Model constants: GOLD_TO_COLLECT=100,GEM_TO_COLLECT=100,B=1300

Warning: Switching to sparse engine and (backwards) Gauss Seidel (default for heuristic=speed).

Building model...
Model constants: GOLD_TO_COLLECT=100,GEM_TO_COLLECT=100,B=1300

Computing reachable states...

Reachability (BFS): 1215 iterations in 0.93 seconds (average 0.000767, setup 0.00)

Time for model construction: 0.88 seconds.

Type:        MDP
States:      958894 (1 initial)
Transitions: 3325526
Choices:     3080702

Transition matrix: 898 nodes (4 terminal), 3325526 minterms, vars: 23r/23c/4nd

Computing rewards...
Engine: Sparse

Building sparse matrix (transitions)... [n=958894, nc=3080702, nnz=3325526, k=4] [53.5 MB]
Building sparse matrix (transition rewards)... [n=958894, nc=3080702, nnz=61206, k=4] [16.1 MB]
Creating vector for state rewards... [7.3 MB]
Allocating iteration vectors... [2 x 7.3 MB]
TOTAL: [91.5 MB]

Starting iterations...
Iteration 187 (of 1300): 5.02 sec so far
Iteration 374 (of 1300): 10.03 sec so far
Iteration 562 (of 1300): 15.05 sec so far
Iteration 750 (of 1300): 20.07 sec so far
Iteration 938 (of 1300): 25.09 sec so far
Iteration 1126 (of 1300): 30.10 sec so far

Iterative method: 1300 iterations in 35.75 seconds (average 0.026709, setup 1.03)

Value in the initial state: 145.28750146751008

Time for model checking: 35.589 seconds.

Result: 145.28750146751008 (value in the initial state)


Overall running time: 37.055 seconds.

---------------------------------------------------------------------

Note: There was 1 warning during computation.